Error bounds for Galerkin’s method for monotone operator equations
نویسندگان
چکیده
منابع مشابه
Error Bounds for Exponential Operator Splittings
Error bounds for the Strang splitting in the presence of unbounded operators are derived in a general setting and are applied to evolutionary Schrödinger equations and their pseudo-spectral space discretization. AMS subject classification: 65M15, 65L05, 65M70.
متن کاملOn error bounds for monotone approximation schemes for multi-dimensional Isaacs equations
Recently, Krylov, Barles, and Jakobsen developed the theory for estimating errors of monotone approximation schemes for the Bellman equation (a convex Isaacs equation). In this paper we consider an extension of this theory to a class of non-convex multidimensional Isaacs equations. This is the first result of this kind for non-convex multidimensional fully non-linear problems. To get the error ...
متن کاملError Bounds for Monotone Approximation Schemes for Non-convex Degenerate Elliptic Equations in R
In this paper we provide estimates of the rates of convergence of monotone approximation schemes for non-convex equations in one spacedimension. The equations under consideration are the degenerate elliptic Isaacs equations with x-depending coefficients, and the results applies in particular to finite difference methods and control schemes based on the dynamic programming principle. Recently, K...
متن کاملError bounds for monotone approximation schemes for parabolic Hamilton-Jacobi-Bellman equations
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general results to various schemes including finite difference schemes, splitting methods and the classical approximation by piecewise constant controls.
متن کاملError Bounds for Monotone Approximation Schemes for Hamilton-Jacobi-Bellman Equations
We obtain error bounds for monotone approximation schemes of Hamilton-Jacobi-Bellman equations. These bounds improve previous results of Krylov and the authors. The key step in the proof of these new estimates is the introduction of a switching system which allows the construction of approximate, (almost) smooth supersolutions for the Hamilton-Jacobi-Bellman equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1972
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1972-0297123-x